منابع مشابه
Music Transcription with ISA and HMM
We propose a new generative model for polyphonic music based on nonlinear Independent Subspace Analysis (ISA) and factorial Hidden Markov Models (HMM). ISA represents chord spectra as sums of note power spectra and note spectra as sums of instrument-dependent log-power spectra. HMM models note duration. Instrument-dependent parameters are learnt on solo excerpts and used to transcribe musical r...
متن کاملInstrument identification in solo and ensemble music using Independent Subspace Analysis
We investigate the use of Independent Subspace Analysis (ISA) for instrument identification in musical recordings. We represent short-term log-power spectra of possibly polyphonic music as weighted non-linear combinations of typical note spectra plus background noise. These typical note spectra are learnt either on databases containing isolated notes or on solo recordings from different instrum...
متن کاملUnderstanding Music Improvisations: A Comparison of Methods of Meaning-Making
The purpose of this qualitative study was to examine the value of different methods of making meaning in music therapy improvisations. Six research participants met with the researcher and created solo and duo improvisations. Each improvisation was subjected to four methods of meaning-making: participant journals, researcher journals, dialogues, and musical analysis using the Improvisation Asse...
متن کاملPostural Coordination during Socio-motor Improvisation
Human interaction often relies on socio-motor improvisation. Creating unprepared movements during social interaction is not a random process but relies on rules of synchronization. These situations do not only involve people to be coordinated, but also require the adjustment of their posture in order to maintain balance and support movements. The present study investigated posture in such a con...
متن کاملA local search 2.917-approximation algorithm for duo-preservation string mapping
We study the maximum duo-preservation string mapping (Max-Duo) problem, which is the complement of the well studied minimum common string partition (MCSP) problem. Both problems have applications in many fields including text compression and bioinformatics. Motivated by an earlier local search algorithm, we present an improved approximation and show that its performance ratio is no greater than...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computers in Human Behavior
دوره 22 شماره
صفحات -
تاریخ انتشار 2006